package com.sunny.查询.二分查找;

import com.sunny.查询.Search;

/**
 * 　注意：二分查找的数组一定是有序的！！！
 */
public class BinarySearch implements Search {
    @Override
    public int search(int[] nums,int target,int low,int high) {
        int left = 0;
        int right = nums.length - 1; // 注意

        while(left <= right) {
            int mid = (right + left) / 2;
            if(nums[mid] == target)
                return mid;
            else if (nums[mid] < target)
                left = mid + 1; // 注意
            else if (nums[mid] > target)
                right = mid - 1; // 注意
        }
        return -1;
    }
}
